0.00/0.11	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.00/0.11	% Command    : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 240 THM
0.10/0.32	% Computer : n024.cluster.edu
0.10/0.32	% Model    : x86_64 x86_64
0.10/0.32	% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.10/0.32	% Memory   : 8042.1875MB
0.10/0.32	% OS       : Linux 3.10.0-693.el7.x86_64
0.10/0.32	% CPULimit   : 1920
0.10/0.32	% WCLimit    : 240
0.10/0.32	% DateTime   : Wed Jul 30 02:19:49 EDT 2025
0.10/0.32	% CPUTime    : 
0.17/0.45	Running higher-order theorem proving
0.17/0.46	Running: /export/starexec/sandbox2/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=240 /export/starexec/sandbox2/tmp/tmp.ehRuDQCA4q/E---3.1_22140.p
1.36/0.75	# Version: 3.0.0-ho
1.36/0.75	# Preprocessing class: HSSSSMSSSSSNSSA.
1.36/0.75	# Scheduled 8 strats onto 8 cores with 240 seconds (1920 total)
1.36/0.75	# Starting post_as_ho12 with 240s (1) cores
1.36/0.75	# Starting new_bool_9 with 240s (1) cores
1.36/0.75	# Starting post_as_ho1 with 240s (1) cores
1.36/0.75	# Starting post_as_ho4 with 240s (1) cores
1.36/0.75	# Starting post_as_ho2 with 240s (1) cores
1.36/0.75	# Starting ehoh_best2_full_lfho with 240s (1) cores
1.36/0.75	# Starting full_lambda_10 with 240s (1) cores
1.36/0.75	# Starting new_ho_8 with 240s (1) cores
1.36/0.75	# ehoh_best2_full_lfho with pid 22223 completed with status 0
1.36/0.75	# Result found by ehoh_best2_full_lfho
1.36/0.75	# Preprocessing class: HSSSSMSSSSSNSSA.
1.36/0.75	# Scheduled 8 strats onto 8 cores with 240 seconds (1920 total)
1.36/0.75	# Starting post_as_ho12 with 240s (1) cores
1.36/0.75	# Starting new_bool_9 with 240s (1) cores
1.36/0.75	# Starting post_as_ho1 with 240s (1) cores
1.36/0.75	# Starting post_as_ho4 with 240s (1) cores
1.36/0.75	# Starting post_as_ho2 with 240s (1) cores
1.36/0.75	# Starting ehoh_best2_full_lfho with 240s (1) cores
1.36/0.75	# No SInE strategy applied
1.36/0.75	# Search class: HGHNF-FFSF11-SSSFFSBC
1.36/0.75	# Scheduled 5 strats onto 1 cores with 240 seconds (240 total)
1.36/0.75	# Starting ehoh_best2_full_lfho with 145s (1) cores
1.36/0.75	# ehoh_best2_full_lfho with pid 22226 completed with status 0
1.36/0.75	# Result found by ehoh_best2_full_lfho
1.36/0.75	# Preprocessing class: HSSSSMSSSSSNSSA.
1.36/0.75	# Scheduled 8 strats onto 8 cores with 240 seconds (1920 total)
1.36/0.75	# Starting post_as_ho12 with 240s (1) cores
1.36/0.75	# Starting new_bool_9 with 240s (1) cores
1.36/0.75	# Starting post_as_ho1 with 240s (1) cores
1.36/0.75	# Starting post_as_ho4 with 240s (1) cores
1.36/0.75	# Starting post_as_ho2 with 240s (1) cores
1.36/0.75	# Starting ehoh_best2_full_lfho with 240s (1) cores
1.36/0.75	# No SInE strategy applied
1.36/0.75	# Search class: HGHNF-FFSF11-SSSFFSBC
1.36/0.75	# Scheduled 5 strats onto 1 cores with 240 seconds (240 total)
1.36/0.75	# Starting ehoh_best2_full_lfho with 145s (1) cores
1.36/0.75	# Preprocessing time       : 0.001 s
1.36/0.75	
1.36/0.75	# Proof found!
1.36/0.75	# SZS status Theorem
1.36/0.75	# SZS output start CNFRefutation
1.36/0.75	thf(decl_23, type, cP: $i > $o).
1.36/0.75	thf(decl_24, type, s: $i > $o).
1.36/0.75	thf(decl_25, type, cR: $i > $i > $o).
1.36/0.75	thf(decl_26, type, esk1_1: $i > $i).
1.36/0.75	thf(decl_27, type, esk2_1: ($i > $o) > $i).
1.36/0.75	thf(decl_28, type, esk3_0: $i).
1.36/0.75	thf(cTHM117B, conjecture, (![X1:$i]:(((s @ X1)=>(cP @ X1)))<=(![X2:$i]:(((cP @ X2)<=![X3:$i]:((((s @ X3)&(cR @ X2 @ X3))=>(cP @ X3)))))&![X4:$i > $o, X5:$i]:((?[X6:$i]:((![X7:$i]:((~((X4 @ X7))<=(cR @ X6 @ X7)))&(X4 @ X6)))<=(X4 @ X5))))), file('/export/starexec/sandbox2/tmp/tmp.ehRuDQCA4q/E---3.1_22140.p', cTHM117B)).
1.36/0.75	thf(c_0_1, negated_conjecture, ~(((![X2:$i]:((![X3:$i]:((((s @ X3)&(cR @ X2 @ X3))=>(cP @ X3)))=>(cP @ X2)))&![X4:$i > $o, X5:$i]:(((X4 @ X5)=>?[X6:$i]:((![X7:$i]:(((cR @ X6 @ X7)=>~((X4 @ X7))))&(X4 @ X6))))))=>![X1:$i]:(((s @ X1)=>(cP @ X1))))), inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[cTHM117B])])).
1.36/0.75	thf(c_0_2, negated_conjecture, ![X15:$i, X17:$i > $o, X18:$i, X20:$i]:(((((((s @ (esk1_1 @ X15))|(cP @ X15))&((cR @ X15 @ (esk1_1 @ X15))|(cP @ X15)))&(~(cP @ (esk1_1 @ X15))|(cP @ X15)))&((~(cR @ (esk2_1 @ X17) @ X20)|~(X17 @ X20)|~(X17 @ X18))&((X17 @ (esk2_1 @ X17))|~(X17 @ X18))))&((s @ esk3_0)&~(cP @ esk3_0)))), inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_1])])])])])])])).
1.36/0.75	thf(c_0_3, negated_conjecture, ![X1:$i, X4:$i > $o, X2:$i]:((~((cR @ (esk2_1 @ X4) @ X1))|~((X4 @ X1))|~((X4 @ X2)))), inference(split_conjunct,[status(thm)],[c_0_2])).
1.36/0.75	thf(c_0_4, negated_conjecture, ![X1:$i]:(((cR @ X1 @ (esk1_1 @ X1))|(cP @ X1))), inference(split_conjunct,[status(thm)],[c_0_2])).
1.36/0.75	thf(c_0_5, negated_conjecture, ![X4:$i > $o, X1:$i]:(((cP @ (esk2_1 @ X4))|~((X4 @ (esk1_1 @ (esk2_1 @ X4))))|~((X4 @ X1)))), inference(spm,[status(thm)],[c_0_3, c_0_4])).
1.36/0.75	thf(c_0_6, negated_conjecture, ![X4:$i > $o, X1:$i]:(((X4 @ (esk2_1 @ X4))|~((X4 @ X1)))), inference(split_conjunct,[status(thm)],[c_0_2])).
1.36/0.75	thf(c_0_7, negated_conjecture, ![X1:$i]:(((cP @ X1)|~((cP @ (esk1_1 @ X1))))), inference(split_conjunct,[status(thm)],[c_0_2])).
1.36/0.75	thf(c_0_8, negated_conjecture, ![X4:$i > $o, X1:$i]:(((X4 @ (esk1_1 @ (esk2_1 @ (^[Z0/* 7 */:$i]:(~((X4 @ Z0)))))))|(cP @ (esk2_1 @ (^[Z0/* 7 */:$i]:(~((X4 @ Z0))))))|(X4 @ X1))), inference(primitive_enumeration,[status(thm)],[inference(cn,[status(thm)],[]), c_0_5])).
1.36/0.75	thf(c_0_9, negated_conjecture, ![X1:$i, X4:$i > $o]:(((X4 @ X1)|~((X4 @ (esk2_1 @ (^[Z0/* 7 */:$i]:(~((X4 @ Z0))))))))), inference(primitive_enumeration,[status(thm)],[inference(cn,[status(thm)],[]), c_0_6])).
1.36/0.75	thf(c_0_10, negated_conjecture, ~((cP @ esk3_0)), inference(split_conjunct,[status(thm)],[c_0_2])).
1.36/0.75	thf(c_0_11, negated_conjecture, ![X1:$i]:((cP @ X1)), inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_7, c_0_8]), c_0_9])).
1.36/0.75	thf(c_0_12, negated_conjecture, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_10, c_0_11])]), ['proof']).
1.36/0.75	# SZS output end CNFRefutation
1.36/0.75	# Parsed axioms                        : 4
1.36/0.75	# Removed by relevancy pruning/SinE    : 0
1.36/0.75	# Initial clauses                      : 10
1.36/0.75	# Removed in clause preprocessing      : 3
1.36/0.75	# Initial clauses in saturation        : 7
1.36/0.75	# Processed clauses                    : 1321
1.36/0.75	# ...of these trivial                  : 44
1.36/0.75	# ...subsumed                          : 750
1.36/0.75	# ...remaining for further processing  : 527
1.36/0.75	# Other redundant clauses eliminated   : 14
1.36/0.75	# Clauses deleted for lack of memory   : 0
1.36/0.75	# Backward-subsumed                    : 3
1.36/0.75	# Backward-rewritten                   : 280
1.36/0.75	# Generated clauses                    : 10781
1.36/0.75	# ...of the previous two non-redundant : 9348
1.36/0.75	# ...aggressively subsumed             : 0
1.36/0.75	# Contextual simplify-reflections      : 3
1.36/0.75	# Paramodulations                      : 10492
1.36/0.75	# Factorizations                       : 0
1.36/0.75	# NegExts                              : 14
1.36/0.75	# Equation resolutions                 : 28
1.36/0.75	# Disequality decompositions           : 0
1.36/0.75	# Total rewrite steps                  : 1693
1.36/0.75	# ...of those cached                   : 1661
1.36/0.75	# Propositional unsat checks           : 0
1.36/0.75	#    Propositional check models        : 0
1.36/0.75	#    Propositional check unsatisfiable : 0
1.36/0.75	#    Propositional clauses             : 0
1.36/0.75	#    Propositional clauses after purity: 0
1.36/0.75	#    Propositional unsat core size     : 0
1.36/0.75	#    Propositional preprocessing time  : 0.000
1.36/0.75	#    Propositional encoding time       : 0.000
1.36/0.75	#    Propositional solver time         : 0.000
1.36/0.75	#    Success case prop preproc time    : 0.000
1.36/0.75	#    Success case prop encoding time   : 0.000
1.36/0.75	#    Success case prop solver time     : 0.000
1.36/0.75	# Current number of processed clauses  : 211
1.36/0.75	#    Positive orientable unit clauses  : 137
1.36/0.75	#    Positive unorientable unit clauses: 0
1.36/0.75	#    Negative unit clauses             : 2
1.36/0.75	#    Non-unit-clauses                  : 72
1.36/0.75	# Current number of unprocessed clauses: 8032
1.36/0.75	# ...number of literals in the above   : 22856
1.36/0.75	# Current number of archived formulas  : 0
1.36/0.75	# Current number of archived clauses   : 316
1.36/0.75	# Clause-clause subsumption calls (NU) : 9536
1.36/0.75	# Rec. Clause-clause subsumption calls : 7031
1.36/0.75	# Non-unit clause-clause subsumptions  : 738
1.36/0.75	# Unit Clause-clause subsumption calls : 1015
1.36/0.75	# Rewrite failures with RHS unbound    : 0
1.36/0.75	# BW rewrite match attempts            : 2172
1.36/0.75	# BW rewrite match successes           : 388
1.36/0.75	# Condensation attempts                : 0
1.36/0.75	# Condensation successes               : 0
1.36/0.75	# Termbank termtop insertions          : 309632
1.36/0.75	# Search garbage collected termcells   : 265
1.36/0.75	
1.36/0.75	# -------------------------------------------------
1.36/0.75	# User time                : 0.264 s
1.36/0.75	# System time              : 0.007 s
1.36/0.75	# Total time               : 0.272 s
1.36/0.75	# Maximum resident set size: 1704 pages
1.36/0.75	
1.36/0.75	# -------------------------------------------------
1.36/0.75	# User time                : 0.264 s
1.36/0.75	# System time              : 0.010 s
1.36/0.75	# Total time               : 0.275 s
1.36/0.75	# Maximum resident set size: 1716 pages
1.36/0.75	% E exiting
1.36/0.75	% E exiting
1.36/0.75	EOF